On rank vs. communication complexity
نویسندگان
چکیده
منابع مشابه
On Rank vs. Communication Complexity
This paper concerns the open problem of Lovász and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems.
متن کاملElectronic Colloquium on Computational Complexity on Rank vs. Communication Complexity
This paper concerns the open problem of Lovasz and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We rst give an example exhibiting the largest gap known. We then prove two related theorems. y Extended Abstract appeared in FOCS 1994. subject "MAIL ME CLEAR", body "pub/eccc/ftpmail.txt" followed by an empty line, ...
متن کاملMatrix Rank in Communication Complexity
This lecture focuses on proving communication lower bounds using matrix rank. Similar to fooling sets and rectangle size bounds, the matrix rank technique also gives a lower bound on the number of monochromatic rectangles in any partition of X × Y but it does so in an algebraic way[1]. This makes algebraic tools available for proving communication lower bounds. We begin by solving the problem a...
متن کاملRecent advances on the log-rank conjecture in communication complexity
The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function is equal to the log of the rank of its associated matrix, up to polynomial factors. Despite much research, we still know very little about this conjecture. Recently, there has been renewed interest in this conjecture...
متن کاملCommunication Complexity and the Log-rank Conjecture
Def: A deterministic protocol computing a function f(x, y) is a binary tree T whose internal nodes specify which party speaks and the value of the bit they communicate, as a function of their input. The leaves of the tree are labelled with 0 or 1, in such a way that if Alice and Bob’s path through the tree given inputs (x, y) ends up in that leaf, the label on the leaf is f(x, y). The cost of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1995
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf01192527